A Cryptosystem Based on DLP gamma = alphaabetab mod p

نویسندگان

  • Sunil Kumar Kashyap
  • Birendra Kumar Sharma
  • Amitabh Banerjee
چکیده

This paper introduces mainly the concept of the Public Key Cryptosystem or PKC, whose security is based on the new Discrete Logarithm Problem known as DLP-III and DLP-IV with the two distinct exponentiations, i.e. γ ≡ αβ mod p in the multiplicative group of the finite field Z∗ p of the order p − 1. We show that the proposed Public Key Cryptosystem based on DLP-IV provides more security because of double computation comparing with the well known the Discrete Logarithm Problem II or DLP-II with one exponentiation, i.e. β ≡ α mod p in the multiplicative group of the finite field Z∗ p of the order p− 1 at the same efficiency level.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptanalysis of the Cryptosystem Based on DLP gamma = alphaabetab

A critique of the proposed encryption scheme based on the DLP γ = αβ is provided. It is described how a plaintext can be obtained from a valid ciphertext by computing a single traditional discrete logarithm in a cyclic group. Furthermore, it is shown that the proposed encryption scheme is in fact equivalent to the ElGamal encryption scheme.

متن کامل

Attacking the Elliptic Curve Discrete Logarithm Problem

Definition 1.1. Given a finite abelian group G written multiplicatively and elements b and g in G, the discrete logarithm problem (DLP) consists of finding an integer n such that bn = g, if such an n exists. The difficulty involved in computing the discrete logarithm varies with the choice of G. For example, in the additive group of integers modulo n, (Z/nZ)+, the problem can be solved efficien...

متن کامل

A Factoring and Discrete Logarithm based Cryptosystem

This paper introduces a new public key cryptosystem based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli) and the discrete logarithm problem. These two hard problems are combined during the key generation, encryption and decryption phases. By combining the IFP and the DLP we introduce a secure and efficient publi...

متن کامل

A New Public Key Cryptosystem based on Matrices

This paper describes a new method for authentication and integrity where the ciphertext is obtained using block upper triangular matrices with elements in p Z , in which the discrete logarithm problem (DLP) defined over a finite group is used. In the proposed public key cryptosystem, the encryption requires very few operations and decryption is equivalent to the DLP and, finally, the signature ...

متن کامل

A New Generalization of the KMOV Cryptosystem

The KMOV scheme is a public key cryptosystem based on an RSA modulus n = pq where p and q are large prime numbers with p ≡ q ≡ 2 (mod 3). It uses the points of an elliptic curve with equation y ≡ x + b (mod n). In this paper, we propose a generalization of the KMOV cryptosystem with a prime power modulus of the form n = pq and study its resistance to the known attacks.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • I. J. Network Security

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2006